A not sign-preserving iteration algorithm for the ‘Improved Normalized Squared Differences’ matrix adjustment model
نویسندگان
چکیده
Abstract Estimating the elements of a matrix, when only margins (row and column sums) are known, but supposedly similar ‘reference matrix’ is available, standard problem in many disciplines. After discussing main types, issues applications these two-directional matrix adjustment problems paper concentrates on case negative models with quadratic objective functions. The solution Improved Normalized Squared Differences (INSD) model proved to be same as result that iteration algorithm which presented paper. It also argued if sign-preservation requirement dropped then procedure suggested by Huang et al. (Econ Syst Res 20(1):111–123, 2008) boils down algorithm. Using numerical example earlier literature it demonstrated even this not sign-preserving case, requires sign-flips for some elements, INSD-model produces good fit mathematical terms.
منابع مشابه
A stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Symmetry Preserving Algorithm for Matrix Scaling
We present an iterative algorithm which asymptotically scales the ∞-norm of each row and each column of a matrix to one. This scaling algorithm preserves symmetry of the original matrix and shows fast linear convergence with an asymptotic rate of 1/2. We discuss extensions of the algorithm to the one-norm, and by inference to other norms. For the 1-norm case, we show again that convergence is l...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
The Generalized Newton Iteration forthe Matrix Sign Function
In this paper we present modiied algorithms for computing deeating subspaces of matrix pencils by means of the matrix sign function. Speciically, our new algorithms reduce the number of iterations to half, cut the cost of each Newton iteration by more than 50%, and improve the accuracy of the computed deeating subspaces. The matrix sign function is thus revealed as an eeective technique for app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2022
ISSN: ['1613-9178', '1435-246X']
DOI: https://doi.org/10.1007/s10100-022-00799-0